Using Constraint Programming to solve a Cryptanalytic Problem

نویسندگان

  • David Gerault
  • Marine Minier
  • Christine Solnon
چکیده

We describe Constraint Programming (CP) models to solve a cryptanalytic problem: the chosen key differential attack against the standard block cipher AES. We show that CP solvers are able to solve these problems quicker than dedicated cryptanalysis tools, and we prove that a solution claimed to be optimal in two recent cryptanalysis papers is not optimal by providing a better solution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method

This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...

متن کامل

Profit maximization solid transportation problem under budget constraint using fuzzy measures

Fixed charge solid transportation problems are formulated as profit maximization problems under a budget constraint at each destination. Here item is purchased in different depots at different prices. Accordingly the item is transported to different destinations from different depots using different vehicles. Unitsare sold from different destinations to the customers at different selling prices...

متن کامل

A Comprehensive Mathematical Model for a Location-routing-inventory Problem under Uncertain Demand: a Numerical Illustration in Cash-in-transit Sector

The purpose of this article is to model and solve an integrated location, routing and inventory problem (LRIP) in cash-in-transit (CIT) sector. In real operation of cash transportation, to decrease total cost and to reduce risk of robbery of such high-value commodity. There must be substantial variation, making problem difficult to formulate. In this paper, to better fit real life applications ...

متن کامل

A Continuous Optimization Model for Partial Digest Problem

The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017